Automated Proof and Program Development

The aim of this paper is to present proof and program development in in-tuitionistic logic and attempt to automating this with tactics and strategies. It is important in computer science to have correct programs and much work has been devoted to this aspect. Typically, the study of the relationships between intuitionistic logic and computer science leads to the programming with proofs, i.e., extracting (correct) programs from proofs. We present program and proof developments using suitable tactics or tacticals with the aim of automating the proof construction and extracting interesting and eecient programs from proofs. Proof (and program) development examples are given showing the relationships between data representations, programs and proofs. Moreover, some remarks about related work and possible future research are given.